Refining the Analysis of Divide and Conquer: How and When
نویسندگان
چکیده
Divide-and-conquer is a central paradigm for the design of algorithms, through which some fundamental computational problems, such as sorting arrays and computing convex hulls, are solved in optimal time within Θ(n logn) in the worst case over instances of size n. A finer analysis of those problems yields complexities within O(n(1 + H(n1, . . . , nk))) ⊆ O(n(1+ log k)) ⊆ O(n logn) in the worst case over all instances of size n composed of k “easy” fragments of respective sizes n1, . . . , nk summing to n, where the entropy function H(n1, . . . , nk) = ∑k i=1 ni n log n ni measures the “difficulty” of the instance. We consider whether such refined analysis can be applied to other algorithms based on divide-and-conquer, such as polynomial multiplication, input-order adaptive computation of convex hulls in 2D and 3D, and computation of Delaunay triangulations.
منابع مشابه
Free Vibration Analysis of Repetitive Structures using Decomposition, and Divide-Conquer Methods
This paper consists of three sections. In the first section an efficient method is used for decomposition of the canonical matrices associated with repetitive structures. to this end, cylindrical coordinate system, as well as a special numbering scheme were employed. In the second section, divide and conquer method have been used for eigensolution of these structures, where the matrices are in ...
متن کاملطراحی ساختاری به روشDivide & Conquer و کاربرد آن در طراحی سوئیچ MSC
This paper presents the structural design for huge systems using Divide & Conquer (D&C) method as a scientific method for optimum designing of complex systems. This method divides the main system into several simple subsystems. Submitted equations in three different cases prove that the optimum response (number of subsystems for minimum system complexity) is independent of main system complexit...
متن کاملQUICKSELECT Revisited
We give an overview of the running time analysis of the random divide-and-conquer algorithm FIND or QUICKSELECT. The results concern moments, distribution of FIND’s running time, the limiting distribution, a stochastic bound and the key: a stochastic fixed point equation.
متن کاملChemometrics-enhanced Classification of Source Rock Samples Using their Bulk Geochemical Data: Southern Persian Gulf Basin
Chemometric methods can enhance geochemical interpretations, especially when working with large datasets. With this aim, exploratory hierarchical cluster analysis (HCA) and principal component analysis (PCA) methods are used herein to study the bulk pyrolysis parameters of 534 samples from the Persian Gulf basin. These methods are powerful techniques for identifying the patterns of variations i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1505.02820 شماره
صفحات -
تاریخ انتشار 2015